Near Optimal Broadcast with Network Coding in Large Sensor Networks
نویسندگان
چکیده
We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum achievable broadcast rate of the source: our central result is a proof of the value of the min-cut for such networks, viewed as hypergraphs. Our metric for efficiency is the number of transmissions necessary to transmit one packet from the source to every destination: we show that IREN/IRON achieves near optimality for large networks; that is, asymptotically, nearly every transmission brings new information from the source to the receiver. As a consequence, network coding asymptotically outperforms any scheme that does not use network coding.
منابع مشابه
Near Optimal Broadcast with Network Coding in Large Homogeneous Wireless Sensor Networks
We propose an efficient broadcast algorithm for wireless sensor networks, based on network coding: we introduce a simple rate selection and analyze its performance (through computation of min-cut). By broadcast, we mean sending data from one source to all the other nodes in the network, and our metric for efficiency is the number of transmissions necessary to transmit one packet from the source...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملClassification and Comparison of Methods for Discovering Coverage Loss Areas in Wireless Sensor Networks
In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. One of the most important challenges in this area, is the signaling network coverage and finding holes. In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accurac...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0708.0975 شماره
صفحات -
تاریخ انتشار 2007